Sufficiency and duality for nonsmooth multiobjective programming problems involving generalized(F,α,ρ,θ)–d–V-univex functions
نویسندگان
چکیده
منابع مشابه
Sufficiency and duality in multiobjective fractional programming problems involving generalized type I functions
*Correspondence: [email protected] Chung-Jen Junior College of Nursing, Health Sciences and Management, Dalin, 62241, Taiwan Abstract In this paper, we establish sufficient optimality conditions for the (weak) efficiency to multiobjective fractional programming problems involving generalized (F,α,ρ ,d)-V-type I functions. Using the optimality conditions, we also investigate a parametric-type dua...
متن کاملBenson's algorithm for nonconvex multiobjective problems via nonsmooth Wolfe duality
In this paper, we propose an algorithm to obtain an approximation set of the (weakly) nondominated points of nonsmooth multiobjective optimization problems with equality and inequality constraints. We use an extension of the Wolfe duality to construct the separating hyperplane in Benson's outer algorithm for multiobjective programming problems with subdifferentiable functions. We also fo...
متن کاملSecond-order Univex Functions and Generalized Duality Models for Multiobjective Programming Problems Containing Arbitrary Norms
Abstract. In this paper, we introduce three new broad classes of secondorder generalized convex functions, namely, (F , b, φ, ρ, θ)-sounivex functions, (F , b, φ, ρ, θ)-pseudosounivex functions, and (F , b, φ, ρ, θ)-quasisounivex functions; formulate eight general second-order duality models; and prove appropriate duality theorems under various generalized (F , b, φ, ρ, θ)-sounivexity assumptio...
متن کاملOptimality Criteria and Duality in Multiobjective Programming Involving Nonsmooth Invex Functions
Abstract. In this paper a generalization of invexity is considered in a general form, by means of the concept of K-directional derivative. Then in the case of nonlinear multiobjective programming problems where the functions involved are nondifferentiable, we established sufficient optimality conditions without any convexity assumption of the K-directional derivative. Then we obtained some dual...
متن کاملSufficiency in multiobjective subset programming involving generalized type-I functions
In this paper, sufficient optimality conditions for a multiobjective subset programming problem are established under generalized (F ,α, ρ,d)-type-I functions.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical and Computer Modelling
سال: 2011
ISSN: 0895-7177
DOI: 10.1016/j.mcm.2010.07.020